Searching is one of the most fundamental operations in many complex systems. However, the complexity of the search process would increase dramatically in high-dimensional space. K-dimensional tree, as a classical data structure, has been widely used in high-dimensional vital data search. However, at present, common methods proposed for KD tree construction are either unstable or time-consuming. This paper proposed a new algorithm to construct a balanced KD tree based on presorted results. Compared with previous similar method, the new algorithm could (...) reduce the complexity of the construction process from O level to O level, where K is the number of dimensions and N is the number of data. In addition, with the help of presorted results, the performance of the new method is no longer subject to the initial conditions, which expands the application scope of KD tree. (shrink)

This volume marks a phase of accomplishment in the work of the World Phenomenology Institute in unfolding a dialogue between Occidental phenomenology and the Oriental/Chinese classic philosophy. Going beyond the stage of reception, the Oriental scholars show in this collection of studies their perspicacity and philosophical skills in comparing the concepts, ideas, the vision of classic phenomenology and Chinese philosophy toward uncovering their common intuitions. This in-depth probing aims at reviving Occidental thinking, reaching to its intuitive sources, as well as (...) providing Chinese thinking with a precise apparatus of expression toward its rejuvenation in a new significance. Studies by Korean and Chinese phenomenologists: Nam-In Lee, Inhui Park, Benjamin I. Schwartz, Anna-Teresa Tymieniecka, Sitansu Ray, Zhang Xian, Zhang Qingxiong, Tsung-I Dow, Ashok K. Gangadean, Yushiro Takei, Louise Sunderarajan, Gregory Tropea, James Sellmann, Tyong Bok Rhie, Sang-Ki Kim, Daniel Zelinski, Qingjie Wang, Calvin O. Schrag, Jung-Sun Han. (shrink)

Let g E(m, n)=o mean that n is the Gödel-number of the shortest derivation from E of an equation of the form (m)=k. Hao Wang suggests that the condition for general recursiveness mn(g E(m, n)=o) can be proved constructively if one can find a speedfunction s s, with s(m) bounding the number of steps for getting a value of (m), such that mn s(m) s.t. g E(m, n)=o. This idea, he thinks, yields a constructivist notion of an effectively computable (...) function, one that doesn't get us into a vicious circle since we intuitively know, to begin with, that certain proofs are constructive and certain functions effectively computable. This paper gives a broad possibility proof for the existence of such classes of effectively computable functions, with Wang's idea of effective computability generalized along a number of dimensions. (shrink)